Learning Artificial Grammars With Competitive Chunking

نویسندگان

  • Emile Servan-Schreiber
  • Arthur Reber
  • Kurt VanLehn
چکیده

When exposed to a regular stimulus field, for instance, that generated by an artificial grammar, subjects unintentionally learn to respond efficiently to the underlying structure (Miller, 1958; Reber 1967). We explored the hypothesis that the learning process is chunking and that grammatical knowledge is implicitly encoded in a hierarchical network of chunks. We trained subjects on exemplar sentences while inducing them to form specific chunks. Their knowledge was then assessed through judgments ofgrammaticality. We found that subjects were less sensitive to violations that preserved their chunks than to violations that did not. We derived the theory of competitive chunking (CC) and found that it successfully reproduces, via computer simulations, both Miller's experimental results and our own. In CC, chunks are hierarchical structures strengthened with use by a bottom-up perception process. Strength-mediated competitions determine which chunks are created and which are used by the perception process.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rule Representations in a Connectionist Chunker

We present two connectionist architectures for chunking of symbolic rewrite rules. One uses backpropagation learning, the other competitive learning. Although they were developed for chunking the same sorts of rules, the two differ in their representational abilities and learning behaviors.

متن کامل

Segmenting vs. Chunking Rules: Unsupervised ITG Induction via Minimum Conditional Description Length

We present an unsupervised learning model that induces phrasal inversion transduction grammars by introducing a minimum conditional description length (CDL) principle to drive search over a space defined by two opposing extreme types of ITGs. Our approach attacks the difficulty of acquiring more complex longer rules when inducing inversion transduction grammars via unsupervised bottom-up chunki...

متن کامل

Combining Top-down and Bottom-up Search for Unsupervised Induction of Transduction Grammars

We show that combining both bottom-up rule chunking and top-down rule segmentation search strategies in purely unsupervised learning of phrasal inversion transduction grammars yields significantly better translation accuracy than either strategy alone. Previous approaches have relied on incrementally building larger rules by chunking smaller rules bottomup; we introduce a complementary top-down...

متن کامل

Rule-Based Chunking and Reusability

In this paper we discuss a rule-based approach to chunking implemented using the LT-XML2 and LT-TTT2 tools. We describe the tools and the pipeline and grammars that have been developed for the task of chunking. We show that our rule-based approach is easy to adapt to different chunking styles and that the mark-up of further linguistic information such as nominal and verbal heads can be added to...

متن کامل

From Finite-State to Inversion Transductions: Toward Unsupervised Bilingual Grammar Induction

We report a wide range of comparative experiments establishing for the first time contrastive foundations for a completely unsupervised approach to bilingual grammar induction that is cognitively oriented toward early category formation and phrasal chunking in the bootstrapping process up the expressiveness hierarchy from finite-state to linear to inversion transduction grammars. We show a cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990